On Quasi-Cyclic Repeat-Accumulate Codes
نویسنده
چکیده
Repeat-Accumulate (RA) codes, consisting of a simple binary repetition followed by a permutation and an accumulator, are converting into quasi-cyclic codes with multiple cross-linked cycles. The algebraic heuristics are used to design codes with an explicit algebraic permutation yielding desirable graph properties. Recursive graph constructions techniques are given for the construction of very long codes. Simulation results for codes of rate 1/3 and 1/4 demonstrate that these algebraic RA codes can compete with RA codes using pseudo-random permutations and outperform the random codes at high SNR.
منابع مشابه
Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels
In this work, we propose structured Root-LowDensity Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping Root-LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-LDPC codes are both suitable for ch...
متن کاملStructured root-LDPC codes and PEG-based techniques for block-fading channels
In this work, we propose structured root-low-density parity-check (LDPC) codes and design techniques for block-fading channels. In particular, quasi-cyclic root-LDPC codes, irregular repeat-accumulate root-LDPC codes and controlled doping root-LDPC codes based on progressive edge growth (PEG) techniques for block-fading channels are proposed. The proposed root-LDPC codes are both suitable for c...
متن کاملOn the Codes over a Semilocal Finite Ring
In this paper, we study the structure of cyclic, quasi cyclic, constacyclic codes and their skew codes over the finite ring R. The Gray images of cyclic, quasi cyclic, skew cyclic, skew quasi cyclic and skew constacyclic codes over R are obtained. A necessary and sufficient condition for cyclic (negacyclic) codes over R that contains its dual has been given. The parameters of quantum error corr...
متن کاملOn quasi-cyclic codes as a generalization of cyclic codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...
متن کامل